Reasoning about actions: steady versus stabilizing state constraints
نویسندگان
چکیده
منابع مشابه
Reasoning About Actions: Steady Versus Stabilizing State Constraints
In formal approaches to commonsense reasoning about actions, the Ramification Problem denotes the problem of handling indirect effects which implicitly derive from so-called state constraints. We pursue a new distinction between two kinds of state constraints which will be proved crucially important for solving the general Ramification Problem. Steady constraints never, not even for an instant,...
متن کاملSteady Versus Stabilizing State Constraints
A new distinction between two kinds of state constraints is introduced and proved important for solving the Ramiication Problem in Reasoning about Actions. Steady constraints never, not even for an instant, cease to being in force. As such they give rise to truly instantaneous indirect eeects of actions. Stabilizing state constraints, on the other hand, may be suspended for a short period of ti...
متن کاملReasoning about Actions: Non-deterministic Eeects, Constraints, and Qualiication
In this paper we propose the language of`state speciications' to uniformly specify eeect of actions , executability condition of actions, and dynamic and static constraints. This language allows us to be able to express eeects of action and constraints with same rst order representation but diierent intuitive behavior to be speciied diierently. We then discuss how we can use state speciications...
متن کاملReasoning about Beliefs and Actions Under Computational Resource Constraints
Reasoning About Beliefs and Actions Under Computational Resource Constraints
متن کاملReasoning about Actions with CHRs and Finite Domain Constraints
We present a CLP-based approach to reasoning about actions in the presence of incomplete states. Constraints expressing negative and disjunctive state knowledge are processed by a set of special Constraint Handling Rules. In turn, these rules reduce to standard finite domain constraints when handling variable arguments of single state components. Correctness of the approach is proved against th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1998
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(98)00084-8